Set Partition Complexes
نویسندگان
چکیده
منابع مشابه
A set partition number system
We propose a number system that is based on set partitions. This represents the third number system that is based on combinatorial objects, the other two being combinations and permutations. A number system based on set partitions is useful in the hardware enumeration of set partitions, which is significantly faster than software enumeration. Specifically, the restricted growth string (b0b1 . ....
متن کاملSet partition patterns and statistics
A set partition σ of [n] = {1, . . . , n} contains another set partition π if restricting σ to some S ⊆ [n] and then standardizing the result gives π. Otherwise we say σ avoids π. For all sets of patterns consisting of partitions of [3], the sizes of the avoidance classes were determined by Sagan and by Goyt. Set partitions are in bijection with restricted growth functions (RGFs) for which Wach...
متن کاملSet Partition Coding: Part II of Set Partition Coding and Image Wavelet Coding Systems
The purpose of this two-part monograph is to present a tutorial on set partition coding, with emphasis and examples on image wavelet transform coding systems, and describe their use in modern image coding systems. Set partition coding is a procedure that recursively splits groups of integer data or transform elements guided by a sequence of threshold tests, producing groups of elements whose ma...
متن کاملPartition complexes , duality and integral tree representations
We show that the poset of non-trivial partitions of {1, 2, . . . , n} has a fundamental homology class with coefficients in a Lie superalgebra. Homological duality then rapidly yields a range of known results concerning the integral representations of the symmetric groups Σn and Σn+1 on the homology and cohomology of this partially-ordered set. AMS Classification 05E25; 17B60, 55P91
متن کامل2K2 vertex-set partition into nonempty parts
A graph is 2K2-partitionable if its vertex set can be partitioned into four nonempty parts A, B, C , D such that each vertex of A is adjacent to each vertex of B, and each vertex of C is adjacent to each vertex of D. Determining whether an arbitrary graph is 2K2-partitionable is the only vertex-set partition problem into four nonempty parts according to external constraints whose computational ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2008
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-008-9106-6